Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

نویسندگان

چکیده

Flow shop scheduling is a type of where sequence follows for each job on set machines processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows changes order to flexibly manage such irregularity. The flexible problems with have mainly addressed optimization floor manufacturing, processing, allied industries. scope this paper identify literature available permutation non-permutation constraint. This organizes based performance measures variability environments. extended summary two/three-machine m -machine has been compiled, including their objectives, algorithms, parametric considerations, findings. A systematic appearance both conceptual analytical results summarizes various advances includes independently investigated suggestions future research directions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

متن کامل

Fuzzy Multi-objective Permutation Flow Shop Scheduling Problem with Fuzzy Processing Times under Learning and Aging Effects

In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...

متن کامل

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective

Makespan minimisation in permutation flow shop scheduling is an OR topic that has been intensively addressed in the last 40 years. Since the problem is known to be NPcomplete for more than two machines, most of the research effort has been devoted to the development of heuristic procedures in order to provide good approximate solutions to the problem. However, little attention has been devoted ...

متن کامل

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

متن کامل

Genetic Algorithm with Selective Local Search for Multi-objective Permutation Flow Shop Scheduling Problem

In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but heuristics for multi-crite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rairo-operations Research

سال: 2021

ISSN: ['1290-3868', '0399-0559']

DOI: https://doi.org/10.1051/ro/2020055